EDGF: Empirical dataset generation framework for wireless network networks

In wireless sensor networks (WSNs), simulation practices, system models, algorithms, and protocols have been published worldwide based on the assumption of randomness. The applied statistics used for randomness in WSNs are broad in nature, e.g., random deployment, activity tracking, packet generation, etc. Even though with adequate formal and informal information provided and pledge by authors, validation of the proposal became a challenging issue. The minuscule information alteration in implementation and validation can reflect the enormous effect on eventual results. In this proposal, we show how the results are affected by the generalized assumption made on randomness. In sensor node deployment, ambiguity arises due to node error-value ($\epsilon$), and it's upper bound in the relative position is estimated to understand the delicacy of diminutives changes. Moreover, the effect of uniformity in the traffic and contribution of scheduling position of nodes also generalized. We propose an algorithm to generate the unified dataset for the general and some specific applications system models in WSNs. The results produced by our algorithm reflects the pseudo-randomness and can efficiently regenerate through seed value for validation

A genetic algorithm inspired optimized cluster head selection method in wireless sensor networks

In this paper, an optimized cluster head (CH) selection method based on genetic algorithm (NCOGA) is proposed which uses the adaptive crossover and binary tournament selection methods to prolong the lifetime of a heterogeneous wireless sensor network (WSN). The novelty of the proposed algorithms is the integration of multiple parameters for the CH selection in a heterogeneous WSN. NCOGA formulates fitness parameters by integrating multiple parameters like the residual energy, initial energy, distance to the sink, number of neighbors surrounded by a node, load balancing factor, and communicating mode decider (CMD). The parameters for load balancing and CMD are utilized to discover out the best candidate to be selected as a relay CH and for deciding the mode of communication (single or multi-hop) of CH. Further, these parameters are useful in avoiding hot-spot problem in the network. The working of the NCOGA starts based on the criteria “consider only those nodes which have energy higher than the pre-defined threshold energy”. This criterion of nodes selection makes the NCOGA more efficient and quickly convergent. Extensive computer simulations are conducted to determine the effectiveness of the NCOGA. Simulation results reveal that the proposed NCOGA outperforms the state-of-the-art optimization algorithms based on GA in terms of several performance metrics, specifically, stability period, residual energy, network lifetime, and throughput